Computability-theoretic learning complexity
نویسندگان
چکیده
منابع مشابه
Computability-theoretic learning complexity.
Initially discussed are some of Alan Turing's wonderfully profound and influential ideas about mind and mechanism-including regarding their connection to the main topic of the present study, which is within the field of computability-theoretic learning theory. Herein is investigated the part of this field concerned with the algorithmic, trial-and-error inference of eventually correct programs f...
متن کاملComputability-theoretic complexity of countable structures
Computable model theory, also called effective or recursive model theory, studies algorithmic properties of mathematical structures, their relations, and isomorphisms. These properties can be described syntactically or semantically. One of the major tasks of computable model theory is to obtain, whenever possible, computability-theoretic versions of various classical model-theoretic notions and...
متن کاملOn the Computability-theoretic Complexity of Trivial, Strongly Minimal Models
We show the existence of a trivial, strongly minimal (and thus uncountably categorical) theory for which the prime model is computable and each of the other countable models computes 0′′. This result shows that the result of Goncharov/Harizanov/Laskowski/Lempp/McCoy (2003) is best possible for trivial strongly minimal theories in terms of computable model theory. We conclude with some remarks a...
متن کاملComputability and Complexity
ion Abstraktion Acceptance problem Akzeptanz-Problem Accepted akzeptiert Accepting state akzeptierender Zustand Ackermann function Ackermann-Funktion Algorithm Algorithmus Alphabet Alphabet Ambiguity problem Zweideutigkeitsproblem Amortized analysis amortisierte Analyse Application Anwendung Argument (Funktions-)Argument Automaton (endlicher) Automat Automaton language (L(M)) die Sprache eines ...
متن کاملHonest Computability and Complexity
Computations manipulate representations of objects, most often strings of symbols taken from some finite alphabet, rather than the objects themselves. Numbers, for example, are usually denoted by sequences of decimal, or binary, or unary digits. In logic, one therefore distinguishes between numbers n, which reside in an ideal Platonic world, and numerals ⌜n⌝, their symbolic representation as (f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences
سال: 2012
ISSN: 1364-503X,1471-2962
DOI: 10.1098/rsta.2011.0320